package com.zql.LeetCode;

import java.util.Stack;

/**
 * Created By ShuHua on 2021/10/22.
 * 使用栈实现队列
 */
public class MyQueue_232 {
    class MyQueue {
        private Stack<Integer> s1, s2;
        /** Initialize your data structure here. */
        public MyQueue() {
            s1=new Stack<>();
            s2=new Stack<>();
        }

        /** Push element x to the back of queue. */
        public void push(int x) {
           s1.push(x);
        }

        /** Removes the element from in front of queue and returns that element. */
        public int pop() {
           if(s2.isEmpty()){
               while(!s1.isEmpty())
                   s2.push(s1.pop());
           }
           return s2.pop();
        }

        /** Get the front element. */
//        public int peek() {
//
//        }
//
//        /** Returns whether the queue is empty. */
//        public boolean empty() {
//
//        }
    }
}
